Successive normalization of rectangular arrays

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SUCCESSIVE NORMALIZATION OF RECTANGULAR ARRAYS By Richard

Standard statistical techniques often require transforming data to have mean 0 and standard deviation 1. Typically, this process of “standardization” or “normalization” is applied across subjects when each subject produces a single number. High throughput genomic and financial data often come as rectangular arrays where each coordinate in one direction concerns subjects who might have different...

متن کامل

Successive Standardization of Rectangular Arrays

In this note we illustrate and develop further with mathematics and examples, the work on successive standardization (or normalization) that is studied earlier by the same authors in [1] and [2]. Thus, we deal with successive iterations applied to rectangular arrays of numbers, where to avoid technical difficulties an array has at least three rows and at least three columns. Without loss, an it...

متن کامل

Transversals of Rectangular Arrays

The paper deals with m by n rectangular arrays whose mn cells are filled with symbols. A section of the array consists of m cells, one from each row and no two from the same column. The paper focuses on the existence of sections that do contain symbols with high multiplicity.

متن کامل

Periodicity in Rectangular Arrays

We discuss several two-dimensional generalizations of the familiar Lyndon-Schützenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We count the number of m×n arrays that are primitive. Finally, we show that one can test primitivity and compute the primitive root of an array in linear time.

متن کامل

Maximum Antichains of Rectangular Arrays

Given a finite partially ordered set B, it is often of interest to describe the largest possible subsets SC B which consist of mutually incomparable elements of B. Such subsets are usually called maximum antichains or maximum Sperner families of .P after Sperner [I 51, who first characterized these maximum antichains in the case that 9 is a finite Boolean lattice, i.e., the set of all subsets o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Statistics

سال: 2010

ISSN: 0090-5364

DOI: 10.1214/09-aos743